ISALT: Inference-based schemes adaptive to large time-stepping for locally Lipschitz ergodic systems
نویسندگان
چکیده
<p style='text-indent:20px;'>Efficient simulation of SDEs is essential in many applications, particularly for ergodic systems that demand efficient both short-time dynamics and large-time statistics. However, locally Lipschitz often require special treatments such as implicit schemes with small time-steps to accurately simulate the measures. We introduce a framework construct inference-based adaptive large (ISALT) from data, achieving reduction time by several orders magnitudes. The key statistical learning an approximation infinite-dimensional discrete-time flow map. explore use numerical (such Euler-Maruyama, hybrid RK4, scheme) derive informed basis functions, leading parameter inference problem. scalable algorithm estimate parameters least squares, we prove convergence estimators data size increases.</p><p style='text-indent:20px;'>We test ISALT on three non-globally SDEs: 1D double-well potential, 2D multiscale gradient system, 3D stochastic Lorenz equation degenerate noise. Numerical results show can tolerate time-step magnitudes larger than plain schemes. It reaches optimal accuracy reproducing invariant measure when medium-large.</p>
منابع مشابه
Stable Split Time Stepping Schemes for Large-Scale Ocean Modeling
from millennial variations of the thermohaline circulation to the rapid timescales of surface gravity waves. LargeAn explicit time integration of the primitive equations, which are often used for numerical ocean simulations, would be subject to a scale ocean circulation models typically eliminate the fastshort time step limit imposed by the rapidly varying external gravity est oscillations thro...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملA locally adaptive time stepping algorithm for the solution to reaction diffusion equations on branched structures
In this paper, we present a numerical method for solving reaction-diffusion equations on one dimensional branched structures. Through the use of a simple domain decomposition scheme, the many branches are decoupled so that the equations can be solved as a system of smaller problems that are tri-diagonal. This technique allows for localized adaptive time stepping, in which the time step used in ...
متن کاملAn adaptive modified firefly algorithm to unit commitment problem for large-scale power systems
Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off. In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Continuous Dynamical Systems - Series S
سال: 2022
ISSN: ['1937-1632', '1937-1179']
DOI: https://doi.org/10.3934/dcdss.2021103